Complexity of linear ill-posed problems in Hilbert space

Information complexity of ill-posed problems may be seen as controversial. On the one hand side there were pessimistic results stating that the complexity is in nite, while on the other hand side the theory of ill-posed problems is well developed. In contrast to well-posed problems (continuous solution operators) the complexity analysis of ill-posed problems (discontinuous solution operators) is impossible without taking into account the impact of noise in the information. Commonly used models consider bounded deterministic noise and unbounded stochastic (Gaussian white) noise. It is common belief that white noise makes ill-posed problems more complex than problems under bounded noise. In this study we shed light on a rigorous complexity analysis of illposed problems providing (tight) lower and upper bounds for both noise models. It will be shown that in contrast to the deterministic case statistical ill-posed problems have nite complexity at every prescribed error level. Moreover, the ill-posedness of the problem raises the issue of adaptation to unknown solution smoothness, and we provide results in this direction.